Computing the prefix of an automaton
نویسندگان
چکیده
منابع مشابه
Computing Covers Using Prefix Tables
An indeterminate string x = x[1..n] on an alphabet Σ is a sequence of nonempty subsets of Σ; x is said to be regular if every subset is of size one. A proper substring u of regular x is said to be a cover of x iff for every i ∈ 1..n, an occurrence of u in x includes x[i]. The cover array γ = γ[1..n] of x is an integer array such that γ[i] is the longest cover of x[1..i]. Fifteen years ago a com...
متن کاملParallel computing using the prefix problem
Spend your time even for only few minutes to read a book. Reading a book will never reduce and waste your time to be useless. Reading, for some people become a need that is to do every day such as spending time for eating. Now, what about you? Do you like to read a book? Now, we will show you a new book enPDFd parallel computing using the prefix problem that can be a new way to explore the know...
متن کاملan investigation about the relationship between insurance lines and economic growth; the case study of iran
مطالعات قبلی بازار بیمه را به صورت کلی در نظر می گرفتند اما در این مطالعه صنعت بیمه به عنوان متغیر مستفل به بیمه های زندگی و غیر زندگی شکسته شده و هم چنین بیمه های زندگی به رشته های مختلف بیمه ای که در بازار بیمه ایران سهم قابل توجهی دارند تقسیم میشود. با استفاده از روشهای اقتصاد سنجی داده های برای دوره های 48-89 از مراکز ملی داده جمع آوری شد سپس با تخمین مدل خود بازگشتی برداری همراه با تعدادی ...
15 صفحه اولan investigation of the types of text reduction in subtitling: a case study of the persian film gilaneh with english subtitles
چکیده ندارد.
15 صفحه اولParallel Algorithms for Computing Linked List Prefix
Given a linked list x1, x2, ..., xn with xi following xi−1 in the list and an associative operation ©, the linked list prefix problem is to compute all prefixes ©ji=1xi, j = 1, 2, ..., n. In this paper we study the linked list prefix problem on parallel computation models. A deterministic algorithm for computing a linked list prefix on a completely connected parallel computation model is obtain...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2000
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita:2000127